AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm
نویسنده
چکیده
In this paper, we present CAC, a new configurable, generic and adaptive algorithm for establishing arc consistency for binary constraints. CAC is configurable, that is by combining some parameters CAC corresponds to any existing AC algorithm: AC-3, AC-4, AC-6, AC-7, AC-2000, AC-2001, AC-8, AC-3d, AC-3.2 and AC-3.3. CAC is generic, like AC-5, because it may takes into account the structure of the constraints. CAC is adaptive because the underlined algorithm can be changed during the computation in order to use the most efficient one. This new algorithm leads to a new nomenclature of the AC algorithms which is based on the different features used by the algorithm like the values that are reconsidered when a domain is modified, or the fact that bidirectionnality is taken into account, or the way a new support is sought. This new nomenclature shows that several new possible combinations are now possible. In other words, we can easily combine some ideas of AC-3 with some ideas of AC-7 and some ideas of AC-2001 with some ideas of AC-6. Some experimental results highlight the advantages
منابع مشابه
An Improved Generic Arc Consistency Algorithm and Its Specializations
Many general and specific arc consistency algorithms have been produced in the past for solving Constraint Satisfaction Problems (CSP). The important general algorithms are AC-3, AC-4, AC-5 and AC-6. AC-5 is also a generic algorithm. It can be reduced to AC-3, AC-4 and AC-6. Specific algorithms are efficient specializations of the general ones for specific constraints. Functional, anti-function...
متن کاملA Generic Arc-Consistency Algorithm and its Specializations
Consistency techniques have been studied extensively in the past as a way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been proposed, originating from Waltz's ltering algorithm [27] and culminating in the optimal algorithm AC-4 of Mohr and Henderson [16]. AC-4 runs in O(ed) in the worst case, where e is the number of arcs (or constra...
متن کاملAdapting Consistency in Constraint Solving
State-of-the-art constraint solvers uniformly maintain the same level of local consistency (usually arc consistency) on all the instances. We propose two approaches to adjust the level of consistency depending on the instance and on which part of the instance we propagate. The first approach, parameterized local consistency, uses as parameter the stability of values, which is a feature computed...
متن کاملAn Efficient Arc Consistency Algorithm for a Class of CSP Problems
Consistency Techniques have been studied extensively in the past as a way of tackling Constraint Satisfaction Problems (CSP). In particular various arc consistency algorithms have been proposed, originating from Waltz's filtering algorithm [20] and culminating in the opt imal algorithm AC-4 of Mohr and Henderson [13]. AC-4 runs in 0(ed) in the worst case where e is the number of arcs (or constr...
متن کاملA fast algorithm to establish arc-consistency in constraint networks
In [1], Bessière and Cordier said that the AC-6 arc-consistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are symmetric. None of the previous algorithms achieving arc-consistency (AC-3, AC-4, AC-6) use this property. We propose here an improved version of AC-6 ...
متن کامل